On the correspondence between nested calculi and semantic systems for intuitionistic logics
نویسندگان
چکیده
منابع مشابه
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call “shallow calculi”, where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima’s calculus for...
متن کاملNested Sequents for Intuitionistic Logics
Nested sequent systems for modal logics were introduced by Kai Brünnler, and have come to be seen as an attractive deep reasoning extension of familiar sequent calculi. In an earlier paper I showed there was a connection between modal nested sequents and modal prefixed tableaus. In this paper I extend the nested sequent machinery to intuitionistic logic, both standard and constant domain, and r...
متن کاملNested Sequents for Intuitionistic Modal Logics
We present cut-free deductive systems without labels for the intuitionistic variants of the modal logics obtained by extending K with a subset of the axioms d, t, b, 4, and 5. For this, we use the formalism of nested sequents. We show a uniform cut elimination argument and a terminating proof search procedure. As a corollary we get the decidability of all modal logics in the intuitionistic S5-c...
متن کاملNested Sequent Calculi and Theorem Proving for Normal Conditional Logics
In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...
متن کاملOn the correspondence between description logics and logics of programs
In the last decade, many e orts have been devoted to an analysis of the epistemological adequacy, and the computational e ectiveness of Description Logics (DLs). In particular, starting with [4], the research on the computational complexity of the reasoning tasks associated with DLs has shown that in order to ensure decidability and/or e ciency of reasoning in all cases, one must renounce to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2020
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exaa078